Automatic Inference of DATR Theories

نویسنده

  • Petra Barg
چکیده

An approach for the automatic acquisition of linguistic knowledge from unstructured data is presented. The acquired knowledge is represented in the lexical knowledge representation language DATR. A set of transformation rules that establish inheritance relationships and a defaultinference algorithm make up the basis components of the system. Since the overall approach is not restricted to a special domain, the heuristic inference strategy uses criteria to evaluate the quality of a DATR theory, where different domains may require different criteria. The system is applied to the linguistic learning task of German noun inflection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Evaluation Semantics for DATR Theories

This paper describes an operational semantics for DATR theories. The semantics is presented as a set of inference rules that axiomatises the evaluation relationship for DATR expressions. The inference rules provide a clear picture of the way in which DATR works, and should lead to a better understanding of the mathematical and computational properties of the language.

متن کامل

Review of Petra Barg (1996)

Given current interest in linguistic knowledge acquisition methods (or 'discovery procedures' in the linguistics jargon of the 1950s and 1960s), Petra Barg's book "The automatic acquisition of linguistic knowledge" 1 is a welcome addition to the literature, particularly since it is the first investigation 2 into the automatic inference of structured analyses of linguistic data in the DATR forma...

متن کامل

A Lexicalized Tree Ad- Joining Grammar for English. a Lexicalized Tree Adjoining Grammar for English. Automatic Acquisition of Datr Theories from Observations. Theories Des Lexicons: 6 Comparison with Related Work 5 Applying Lexical Rules

This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to de ne an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures. Such an approach eliminates the considerable redundan...

متن کامل

Inference in DATR

DATR is a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance. The principal intended area of application is the representation of lexical entries for natural language processing, and we use examples from this domain throughout. In this paper we present the syntax and inference mechanisms for the language. The goal o...

متن کامل

DATR Theories and DATR Models

Evans and Gazdar (Evans and Gazdar, 1989a; Evans and Gazdar, 1989b) introduced DATR as a simple, non-monotonic language for representing natural language lexicons. Although a number of implementations of DATR exist, the full language has until now lacked an explicit, declarative semantics. This paper rectifies the situation by providing a mathematical semantics for DATR. We present a view of DA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره cmp-lg/9601001  شماره 

صفحات  -

تاریخ انتشار 1995